A partial ordering semantics for CCS
نویسندگان
چکیده
منابع مشابه
A Partial Ordering Semantics for CCS
A new operatilcrnql semantics for *‘pure” CCS is proposed that considers the parallel operator as a first class one, and permits a description of the calculus in terms of partial orderings. The new semantics (also for unguarded agents) is given in the SOS style via the partial ordering derivation relation. CCS agenis are decomposed into sets of sequential subagents. The new derivations relate s...
متن کاملInterleaving based Partial Ordering Semantics
This paper present a partial ordering semantics for process calculi. The semantics is deened in SOS style and it is based on transition systems. We adopt proved transition system, whose transitions are labelled with encodings of their proofs and whose nodes are the same of the classical interleaving semantics. Relabelling functions are deened to retrive causal models that can take generation or...
متن کاملSos Partial Ordering Semantics of -calculus
In this paper we present a partial ordering semantics for the-calculus. The model we adopt is transition system based. In spite of their inter-leaving nature, we show that it is possible to completely abstract from the generation ordering of transitions. The deenition of this semantics drive us in deening a standard SOS semantics that directly yields the partial ordering semantics of-calculus.
متن کاملA Fully Abstract Semantics for Value-passing CCS for Trees
This paper provides a fully abstract semantics for valuepassing CCS for trees (VCCTS). The operational semantics is given both in terms of a reduction semantics and in terms of a labelled transition semantics. The labelled transition semantics is non-sequential, allowing more than one action occurring simultaneously. We develop the theory of behavioral equivalence by introducing both weak barbe...
متن کاملNon Interleaving Semantics for CCS and Fast Deadlock Detection
This paper proposes a non interleaving semantics for CCS and de nes a class of CCS compositions for which interleaving and non interleaving se mantics are equivalent It also presents a fast software tool for analysis of CCS compositions under non interleaving semantics The tool employs Petri net techniques with multiple transition rings Contact jacek cse unsw oz au
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90095-y